Homogeneous 2-partite digraphs
نویسنده
چکیده
We call a 2-partite digraph D homogeneous if every isomorphism between finite induced subdigraphs that respects the 2-partition of D extends to an automorphism of D that does the same. In this note, we classify the homogeneous 2-partite digraphs.
منابع مشابه
The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
A digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair of mutually opposite arcs is called a semicomplete n-partite digraph. We call (D)=max16 i6 n{|Vi|} the independence number of the semicomplete n-partite digraph D, where V1; V2; : : : ; Vn are the partite sets of D. Let p and c, respectively, denote the number of vertices in a longest directed path and t...
متن کاملCyclically k-partite digraphs and k-kernels
Let D be a digraph, V (D) and A(D) will denote the sets of vertices and arcs of D, respectively. A (k, l)-kernel N of D is a k-independent set of vertices (if u, v ∈ N then d(u, v), d(v, u) ≥ k) and l-absorbent (if u ∈ V (D) − N then there exists v ∈ N such that d(u, v) ≤ l). A k-kernel is a (k, k − 1)-kernel. A digraph D is cyclically k-partite if there exists a partition {Vi} i=0 of V (D) suc...
متن کاملSemi-evenly partite star-factorization of symmetric complete tripartite digraphs
We show that necessary and sufficient conditions for the existence of a semi-evenly partite star factorization of the symmetric complete tripartite digraph K~I,n2,n3 are (i) k is even, k 2 4 and (ii) nl = n2 = n3 == 0 (mod k(k -1)/3) for k == 0 (mod 6) and nl = n2 = n3 == 0 (mod k(k 1)) for k == 2,4 (mod 6).
متن کاملCycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
A digraph obtained by replacing each edge of a complete m-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete m-partite digraph. We describe results (theorems and algorithms) on directed walks in semicomplete mpartite digraphs including some recent results concerning tournaments.
متن کاملMultipartite Moore Digraphs
We derive some Moore-like bounds for multipartite digraphs, which extend those of bipartite digraphs, assuming that every vertex of a given partite set is adjacent to the same number of vertices (δ) in each of the other independent sets. We determine when a Moore multipartite digraph is weakly distanceregular. Within this framework, some necessary conditions for the existence of a Moore r-parti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 327 شماره
صفحات -
تاریخ انتشار 2014